Improving Connectionist Energy Minimization
نویسندگان
چکیده
منابع مشابه
Improving Connectionist Energy Minimization
Symmetric networks designed for energy minimization such as Boltzman machines and Hop eld nets are frequently investigated for use in optimization, constraint satisfaction and approximation of NP-hard problems. Nevertheless, nding a global solution (i.e., a global minimum for the energy function) is not guaranteed and even a local solution may take an exponential number of steps. We propose an ...
متن کاملImproving a connectionist based syntactical language model
Using a connectionist model as one of the components of the Structured Language Model has lead to significant improvements in perplexity and word error rate, mainly because of the connectionist model’s power in using longer contexts and its ability in fighting the data sparseness problem. For its training, the SLM needs the syntactical parses of the word strings in the training data, provided b...
متن کاملFunction Minimization for Dynamic Programming Using Connectionist Networks
Learning controllers based on dynamic programming require some means of storing arbitrary functions and finding global minima within cross sections of those functions. There are many general methods for learning and representing functions, including polynomials, multi-layer perceptrons with backpropagation, and radial basis functions, but these systems do not allow the minima to be found easily...
متن کاملEnergy Minimization with Discontinuities
Many tasks in computer vision can be formulated as energy minimization problems. In this paper, we consider a natural class of energy functions that permits discontinuities. We show that minimizing these energy functions is NP-hard. However, the energy minimization problem can be solved by computing a minimum cost multiway cut on an associated graph. This allows the use of approximation algorit...
متن کاملA Free Energy Minimization
As submitted to Electronics Letters, except including an appendix giving pseudocode. Abstract An algorithm is derived for inferring a binary vector s given noisy observations of Asmodulo2, where A is a binary matrix. Here, the binary vector is replaced by a vector of probabilities, optimized by free energy minimization. Experiments on the inference of the state of a linear feedback shift regist...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 1995
ISSN: 1076-9757
DOI: 10.1613/jair.130